Pseudorandom Generators for Polynomial Threshold Functions
نویسندگان
چکیده
منابع مشابه
Pseudorandom Generators for Low Sensitivity Functions
A Boolean function is said to have maximal sensitivity s if s is the largest number of Hamming neighbors of a point which differ from it in function value. We construct a pseudorandom generator with seed-length 2O( √ s) · log(n) that fools Boolean functions on n variables with maximal sensitivity at most s. Prior to our work, the best pseudorandom generators for this class of functions required...
متن کاملMultivariate permutation polynomial systems and nonlinear pseudorandom number generators
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques studied previously for inversive generators, we bound exponential sums along the orbits of these dynamical systems and show that they admit much stronger estima...
متن کاملPolynomial Threshold Functions and Boolean Threshold Circuits
We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is {1, 2}. We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two thre...
متن کاملPseudorandom Generators for Group Products
We prove that the pseudorandom generator introduced by Impagliazzo et al. in [INW94] with proper choice of parameters fools group products of a given finite group G. The seed length is O(log n(|G|O(1)+log 1 δ )), where n is the length of the word and δ is the allowed error. The result implies that the pseudorandom generator with seed length O(log n(2 logw) + log 1 δ )) fools read-once permutati...
متن کاملCOS598D Lecture 3 Pseudorandom generators from one-way functions
In this lecture we prove the existence of pseudorandom-generators assuming that one-way functions exist (Hastad, Impagliazzo, Levin and Luby '99). Our proof is with respect to non-uniform security. We also sketch the uniform case which requires a uniform version of Impagliazzo's hardcore set lemma that uses ideas from learning theory. We briefly recall some standard notions from cryptography. F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2013
ISSN: 0097-5397,1095-7111
DOI: 10.1137/100811623